Competition for the attention of a "problem solver"

نویسندگان

  • Jacob Glazer
  • Ariel Rubinstein
چکیده

We introduce a new type of agent, whom we refer to as a "problem solver" (PS). The PS interacts with conventional players and wishes to respond optimally to their moves. The PS has only partial information about the moves of the other players. Unlike a regular player, the PS does not "put himself in the shoes" of other players and does not form beliefs about their moves. Rather, he treats the data as a logical puzzle: he calculates the set of possible configurations of moves that are consistent with the data he observes and responds to it. We insert such a problem solver into a simple model of competition for attention and analyze its equilibria. We demonstrate a novel feature of equilibrium in the model, whereby even though the PS always succeeds in his task, he may be uncertain that he will do so. The second author acknowledges financial support from ERC grant 269143. Our thanks to Noga Alon, Ayala Arad, Kfir Eliaz, Gil Kalai and Rani Spiegler for helpful conversations. Page: 1 Date: 7/27/2015

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Aerodynamic Design Optimization Using Genetic Algorithm (RESEARCH NOTE)

An efficient formulation for the robust shape optimization of aerodynamic objects is introduced in this paper. The formulation has three essential features. First, an Euler solver based on a second-order Godunov scheme is used for the flow calculations. Second, a genetic algorithm with binary number encoding is implemented for the optimization procedure. The third ingredient of the procedure is...

متن کامل

Solving the Unit Commitment Problem Using Modified Imperialistic Competition Algorithm

One of the most important problems for power system operation is unit commitment (UC), for which different constraints should be satisfied. UC is a nonlinear and large-scale problem; thus, using the evolutionary algorithms has been considered for solving the problem. In this paper, the solution of the UC problem was investigated using Modified Imperialistic Competition Algorithm (MICA).  Simula...

متن کامل

Security Constrained Unit Commitment in the Simultaneous Presence of Demand Response Sources and Electric Vehicles

Due to the ever-growing load, especially peak load, the increase in the capacity of plants is inevitable for the response to this growth. Peak load causes increases in customer costs and vast investments in generating and transmission parts. Therefore, restructuring in the electrical industry, competition in the electrical market and Demand Response Programs (DRPs) are of special importance in ...

متن کامل

A Lagrangian Decomposition Algorithm for Robust Green Transportation Location Problem

In this paper, a green transportation location problem is considered with uncertain demand parameter. Increasing robustness influences the number of trucks for sending goods and products, caused consequently, increase the air pollution. In this paper, two green approaches are introduced which demand is the main uncertain parameter in both. These approaches are addressed to provide a trade-off b...

متن کامل

Controller Placement in Software Defined Network using Iterated Local Search

Software defined network is a new computer network architecture who separates controller and data layer in network devices such as switches and routers. By the emerge of software defined networks, a class of location problems, called controller placement problem, has attracted much more research attention. The task in the problem is to simultaneously find optimal number and location of controll...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015